Browsing by Subject "Communication topologies"
Now showing items 1-10 of 10
-
Conference Object
Distributed balancing of a digraph with integer weights
(Institute of Electrical and Electronics Engineers Inc., 2013)We address the integer weight-balancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology ...
-
Article
Distributed Balancing of Commodity Networks Under Flow Interval Constraints
(2018)We consider networks the nodes of which are interconnected via directed edges, each able to admit a flow (or weight) within a certain interval, with nonnegative end points that correspond to lower and upper flow limits. ...
-
Conference Object
Distributed balancing under interval flow constraints in directed communication topologies
(Institute of Electrical and Electronics Engineers Inc., 2018)In this paper, we propose a distributed algorithm that relies on a strongly connected (but possibly directed) communication topology to achieve admissible and balanced flows in a given network. More specifically, we consider ...
-
Conference Object
Distributed formation of balanced and bistochastic weighted digraphs in multi-agent systems
(2013)We propose two distributed algorithms, one for solving the weight-balance problem and another for solving the bistochastic matrix formation problem, in a distributed system whose components (nodes) can exchange information ...
-
Conference Object
Distributed minimum-time weight balancing over digraphs
(IEEE Computer Society, 2014)We address the weight-balancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology (digraph). ...
-
Conference Object
Distributed network size estimation and average degree estimation and control in networks isomorphic to directed graphs
(2012)Many properties of interest in graph structures are based on the nodes' average degree (i.e., the average number of edges incident to/from each node). In this work, we present asynchronous distributed algorithms, based on ...
-
Conference Object
Distributed strategies for balancing a weighted digraph
(2012)A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role ...
-
Conference Object
Privacy-preserving asymptotic average consensus
(2013)In this paper, we develop and analyze a distributed privacy-preserving average consensus algorithm that enables all of the components of a distributed system, each with some initial value, to asymptotically reach average ...
-
Doctoral Thesis
Reasoning about systems with evolving structure
(University of Warwick, 1996)
-
Conference Object
Resilient average consensus in the presence of heterogeneous packet dropping links
(2012)We address the average-consensus problem for a distributed system whose components (nodes) can exchange information via unreliable interconnections (edges) that form an arbitrary, possibly directed topology (digraph). We ...